Relative Expressiveness of Well-Founded Defeasible Logics
نویسنده
چکیده
An approach to formulating relative expressiveness of defeasible logics was introduced in [14]. In this paper we address the relative expressiveness of the well-founded defeasible logics in the framework WFDL and their relationship to the defeasible logics in the framework DL. We show that, in terms of defeasible reasoning, the logics in WFDL have greater (or equal) expressiveness than those in DL, but it is not clear whether they have strictly greater expressiveness. We also show that different treatments of ambiguity lead to different expressiveness in WFDL, as it does in DL.
منابع مشابه
Relative expressiveness of defeasible logics II
(Maher 2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the defeasible logics in the DL framework are equally expressive under this formulation of relative expressiveness. The second formulation of relative expressiveness i...
متن کاملRelative expressiveness of defeasible logics
We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be modular, in the sense that they also work if applied only to part of a theory, in order to achieve a useful notion of relative expressiveness. We present simulation...
متن کاملComparing Defeasible Logics
In this paper we seek to formally establish the similarities and differences between two formalizations of defeasible reasoning: the defeasible logics of Nute and Maier, and defeasible logics in the framework of Antoniou et al. Both families of logics have developed from earlier logics of Nute, but their development has followed different paths and they are formulated very differently. We exami...
متن کاملA Semantic Decomposition of Defeasible Logics
We investigate defeasible logics using a technique which decomposes the semantics of such logics into two parts: a specification of the structure of defeasible reasoning and a semantics for the meta-language in which the specification is written. We show that Nute’s Defeasible Logic corresponds to Kunen’s semantics, and develop a defeasible logic from the well-founded semantics of Van Gelder, R...
متن کاملOn the Problem of Computing Ambiguity Propagation and Well-Founded Semantics in Defeasible Logic
In this paper we present the well founded variants of ambiguity blocking and ambiguity propagating defeasible logics. We also show how to extend SPINdle, a state of the art, defeasible logic implementation to handle all such variants of defeasible logic.
متن کامل